A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In paper, we use programming find path due their generality, reduction of complexity facilitation numerical computation, simplicity incorporating constraints, onformity stochastic nature some problems. The routing a multi-objective optimization with constraints such as capacity end-to-end delay. Single-constraint problems solutions using Dijkstra, Bellman-Ford, Floyd-Warshall algorithms proposed work discussion on difference between them. These through finding optimal rate two nodes but bounded Dijkstra-based algorithm especially favorable terms processing time. We also present comparison our single-constraint (MRA) existing literature clarify merits former.